Accepting networks of splicing processors: Complexity results
نویسندگان
چکیده
منابع مشابه
Accepting networks of splicing processors: Complexity results
In this paper we consider a new, bio-inspired computing model: the accepting network of splicing processors. We define two computational complexity classes based on this model and show how they are related to the classical ones defined for Turing machines, namely NP and PSPACE. Furthermore, we approach the topic of problem solving using these newly defined devices. In this context, a linear tim...
متن کاملComplexity results for deciding Networks of Evolutionary Processors
The Accepting Networks of Evolutionary Processors (ANEPs for short) are bio-inspired computational models which were introduced and thoroughly studied in the last decade. In this paper we propose a method of using ANEPs as deciding devices. More precisely, we define a new halting condition for this model, which seems more coherent with the rest of the theory than the previous such definitions, ...
متن کاملTarget Based Accepting Networks of Evolutionary Processors with Regular Filters
In this paper, a new definition of accepting networks – called target based accepting networks – is given. In a target based accepting network of evolutionary processors, each node is equipped with a regular language – the target set. As soon as a node contains a word of its target set, the input word is accepted by the network. In this way, no further output nodes are necessary. It is shown th...
متن کاملAccepting Networks of Evolutionary Processors with Filtered Connections
In this paper we simplify a recent model of computation considered in [Margenstern et al. 2005], namely accepting network of evolutionary processors, by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that input and output filters, respectively, of the two nodes connected by the edge coincide. Thus, the possibility of controlling the computation in ...
متن کاملAccepting Networks of Genetic Processors are computationally complete
We propose a computational model that is inspired by genetic operations over strings such as mutation and crossover. The model, Accepting Network of Genetic Processors, is highly related to previously proposed ones such as Networks of Evolutionary Processors and Networks of Splicing Processors. These models are complete computational models inspired by DNA evolution and recombination. Here, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.10.015